/LMAR=0/XLINE=3/FONT#0=BAXL30
␈↓ ↓H␈↓␈↓ εH␈↓ 91


␈↓ ↓H␈↓␈↓ ∧+COMPUTER SCIENCE DEPARTMENT
␈↓ ↓H␈↓␈↓ ¬πSTANFORD UNIVERSITY


␈↓ ↓H␈↓CS206  ␈↓ βZCOMPUTING WITH SYMBOLIC EXPRESSIONS  ␈↓ 
SPRING 1979


␈↓ ↓H␈↓␈↓ ¬MCOURSE FACTS 


␈↓ ↓H␈↓Instructor:␈↓ β8Douglas Lenat
␈↓ ↓H␈↓␈↓ ↓xOffice:␈↓ β8Serra House (497-4878) or AI Lab (497-4971)
␈↓ ↓H␈↓    Hours:␈↓ β8Fri 3-5 in Serra House before May 1, Margaret Jacks Hall after May 1.


␈↓ ↓H␈↓TA:␈↓ β8Russ Greiner
␈↓ ↓H␈↓␈↓ ↓xOffice:␈↓ β8Serra House (497-4878) or AI Lab (497-4971)
␈↓ ↓H␈↓␈↓ ↓xHours:␈↓ β8Thu 3-5 (Serra, thenMargaret Jacks Hall).


␈↓ ↓H␈↓Course Meets:␈↓ β8T,Th 11:00-12:15
␈↓ ↓H␈↓␈↓ β8Room 370 (outer quad)


␈↓ ↓H␈↓Texts:␈↓ β8McCarthy and Talcott, LISP (from Marion Hazen, Serra House)
␈↓ ↓H␈↓␈↓ β8MACLISP Manual (to appear in bookstore)
␈↓ ↓H␈↓␈↓ β8LISP on LOTS Mini-manual (handout)
␈↓ ↓H␈↓␈↓ β8Winston, Artificial Intelligence (Optional)
␈↓ ↓H␈↓␈↓ β8Weissman, Clark, LISP 1.5 Primer (Very Optional)



␈↓ ↓H␈↓Course␈αWork:␈α    This␈αcourse␈α
consists␈αof␈αlectures,␈αhomework␈α
(which␈αcounts␈α50␈αpoints),␈α
a␈αmidterm
␈↓ ↓H␈↓␈↓ αHexamination␈α
(20␈α
points),a␈α
final␈α
examination␈α
(20␈α
points),␈α
and␈α
an␈α
optional␈α
term␈αproject␈α
(20
␈↓ ↓H␈↓␈↓ αHpoints).␈α
Projects␈αwill␈α
be␈α
due␈αon␈α
the␈α
 day␈αof␈α
the␈α
final␈α examination.␈α
 It␈α
is␈αpossible␈α
to␈αget␈α
a
␈↓ ↓H␈↓␈↓ αHgrade␈α
of␈α
B␈α
or␈α
Pass␈α
in␈α
the␈α
course␈α
without␈α
doing␈α
a␈α
 project,␈α
and␈α
the␈α
grade␈α
of␈α
INC␈α will␈α
be
␈↓ ↓H␈↓␈↓ αHgiven␈α≤only␈α≤under␈α≤exceptional␈α≤circumstances.␈α≤ A␈α≤handout␈α≤with␈α≤more␈α≤complete
␈↓ ↓H␈↓␈↓ αHinformation on the term project will be out soon.



␈↓ ↓H␈↓Computer:␈α
   We␈α
will␈α
be␈αusing␈α
the␈α
LOTS␈α
computing␈α
facility.␈α It␈α
is␈α
located␈α
in␈α
the␈αCERAS␈α
building
␈↓ ↓H␈↓␈↓ αH(beyond␈α⊃the␈α⊃bookstore).␈α⊂ LOTS␈α⊃is␈α⊃open␈α⊂24␈α⊃hours␈α⊃a␈α⊂day.␈α⊃ To␈α⊃get␈α⊂an␈α⊃account,␈α⊃go␈α⊂to
␈↓ ↓H␈↓␈↓ αHLOTS,␈α⊃obtain␈α⊃an␈α⊃"Introduction␈α⊃to␈α⊃LOTS"␈α⊃handout␈α⊃and␈α⊃fill␈α⊃out␈α⊃the␈α⊃attached␈α⊃form.
␈↓ ↓H␈↓␈↓ αHThen␈α∞find␈α∞an␈α∞available␈α∞terminal,␈α∞type␈α∞OPEN␈α∞after␈α∞getting␈α∞the␈α∞system's␈α∞attention,␈α∞and
␈↓ ↓H␈↓␈↓ αHfollow␈αthe␈αinstructions.␈α Your␈αaccount␈αshould␈αbe␈αready␈αafter␈αone␈αworking␈αday.␈α You␈αcan
␈↓ ↓H␈↓␈↓ αH"login" as GUEST with password GUEST just to try the system out.
␈↓ ↓H␈↓␈↓ εH␈↓ 92


␈↓ ↓H␈↓␈↓ ∧{COURSE REFERENCE LIST 

␈↓ ↓H␈↓        The␈α∪following␈α∪books,␈α∪manuscripts,␈α∪papers,␈α∀reports,␈α∪etc.␈α∪are␈α∪available␈α∪at␈α∀the␈α∪Computer
␈↓ ↓H␈↓Science Library:

␈↓ ↓H␈↓    [SAILON␈α
is␈α
an␈α∞abbreviation␈α
for␈α
Stanford␈α∞Artificial␈α
Intelligence␈α
Laboratory␈α∞Operating␈α
Note;
␈↓ ↓H␈↓AIM abbreviates Artificial Intelligence Memo.]

␈↓ ↓H␈↓␈↓ αHAllen,␈α⊃John␈α⊃R.,␈α⊃"Anatomy␈α⊃of␈α⊃LISP",␈α⊃(manuscript␈α⊃on␈α⊃LISP␈α⊃and␈α∩its␈α⊃implementations)
␈↓ ↓H␈↓␈↓ βλMcGraw-Hill, 1978.
␈↓ ↓H␈↓␈↓ αHBaumgart,␈αBruce␈αG.,␈α"MICRO␈αPLANNER␈αAlternate␈αReference␈αManual",␈αSAILON␈α67,
␈↓ ↓H␈↓␈↓ βλ1972.
␈↓ ↓H␈↓␈↓ αHBerkeley,␈α_E.C.␈α_and␈α↔D.G.␈α_Bobrow,␈α_eds.,␈α↔"The␈α_Programming␈α_Language␈α_LISP:␈α↔Its
␈↓ ↓H␈↓␈↓ βλOperation␈α⊃and␈α⊃Applications",␈α⊃Information␈α⊃International,␈α⊃Inc.,␈α⊃Cambridge,␈α⊂Mass.,
␈↓ ↓H␈↓␈↓ βλ1964.
␈↓ ↓H␈↓␈↓ αHBobrow,␈α∀D.G.␈α∀and␈α∃B.␈α∀Raphael,␈α∀"New␈α∃Programming␈α∀Languages␈α∀for␈α∃AI␈α∀Research",
␈↓ ↓H␈↓␈↓ βλXEROX CSL-73-2, 1976.
␈↓ ↓H␈↓␈↓ αHFriedman,␈α∃D.P.␈α∃and␈α∃D.S.␈α∃Wise,␈α∃"An␈α∃Environment␈α∃for␈α⊗Multiple-Valued␈α∃Recursive
␈↓ ↓H␈↓␈↓ βλProcedures", Indiana University Comp. Sci. Dept. Technical Report #40, 1975.
␈↓ ↓H␈↓␈↓ αHFriedman,␈α⊂D.P.␈α⊃and␈α⊂D.S.␈α⊃Wise,␈α⊂"Cons␈α⊃Should␈α⊂not␈α⊃Evaluate␈α⊂Its␈α⊃Arguments",␈α⊂Indiana
␈↓ ↓H␈↓␈↓ βλUniversity Comp. Sci. Dept. Technical Report #44, 1976.
␈↓ ↓H␈↓␈↓ αHHenderson,␈αP.␈αand␈α
J.H.␈αMorris,␈α "A␈αLazy␈α
Evaluator",␈αThird␈αACM␈αSymp␈α
on␈αPrinciples
␈↓ ↓H␈↓␈↓ βλof Programming Languages, 95-103, 1976.
␈↓ ↓H␈↓␈↓ αHMaurer,␈α&W.D.,␈α&"The␈α&Programmer's␈α%Introduction␈α&to␈α&LISP",␈α&MacDonald␈α%/
␈↓ ↓H␈↓␈↓ βλAmerican Elsevier, 1972.
␈↓ ↓H␈↓␈↓ αHMcCarthy, John, et al, "LISP 1.5 Programmer's Guide", MIT Press, 1965.
␈↓ ↓H␈↓␈↓ αHSiklossy, L., "Let's Talk LISP",  Prentice Hall, 1976.
␈↓ ↓H␈↓␈↓ αHSmith, D.C., "MLISP", AIM 135, 1970.
␈↓ ↓H␈↓␈↓ αHSussman,␈α∀G.J.␈α∀and␈α∀G.L.␈α∀Steele,␈α∀"SCHEME,␈α∀An␈α∀Interpreter␈α∀for␈α∃Extended␈α∀Lambda
␈↓ ↓H␈↓␈↓ βλCalculus", MIT-AI Memo 349, 1975.
␈↓ ↓H␈↓␈↓ αHSussman,␈α
G.J.␈αand␈α
G.L.␈αSteele,␈α
"LAMBDA,␈αThe␈α
Ultimate␈αImperitave",␈α
MIT-AI␈αMemo
␈↓ ↓H␈↓␈↓ βλ353, 1976.
␈↓ ↓H␈↓␈↓ αHSteele, G.L., "LAMBDA, The Ultimate Delclaritave", MIT-AI Memo 379, 1976.
␈↓ ↓H␈↓␈↓ αHTeitelman,␈α∂W.,␈α∂D.␈α∂Bobrow,␈α∂and␈α∂A.␈α∂Hartley,␈α∂"INTERLISP␈α∂Reference␈α∂Manual",␈α∞Xerox
␈↓ ↓H␈↓␈↓ βλPARC, 1973.
␈↓ ↓H␈↓␈↓ αHWeissman, C., "LISP 1.5 Primer", Dickenson, Belmont, CA., 1967.


␈↓ ↓H␈↓Other publications about LISP, data structures, and other languages used in AI:
␈↓ ↓H␈↓␈↓ αHHewitt,␈α⊃C.,␈α⊂"Description␈α⊃and␈α⊂Theoretical␈α⊃Analysis␈α⊂(Using␈α⊃Schemata)␈α⊃of␈α⊂PLANNER",
␈↓ ↓H␈↓␈↓ βλMIT-AI Technical Report 258, 1972.
␈↓ ↓H␈↓␈↓ αHLondon, R., "Correctness of Two Compilers for a LISP Subset", AIM-151, 1971.
␈↓ ↓H␈↓␈↓ αHMcDermott,␈α∞D.V.␈α∞and␈α∞G.J.␈α∞Sussman,␈α∞"The␈α∞CONNIVER␈α∞Reference␈α∂Manual",␈α∞MIT-AI
␈↓ ↓H␈↓␈↓ βλTechnical Report 259,  1972.
␈↓ ↓H␈↓␈↓ αHRulifson,␈α∩J.F.,␈α∩J.A.␈α∩Dirkson␈α∩and␈α⊃R.J.␈α∩Waldinger,␈α∩"QA4:␈α∩A␈α∩Procedural␈α∩Calculus␈α⊃for
␈↓ ↓H␈↓␈↓ βλIntuitive Reasoning", SRI-AIC Technical Note 73, 1972.